Servicing database requests using canonicalized tables

ABSTRACT

Servicing database requests using canonicalized tables including receiving, from a client computing system, a request for a table from a database; determining that a canonical version of the requested table matches a canonicalized table in a canonical table repository; and providing, to the client computing system, the matching canonicalized table that is transformed based on the received request for the table.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation application of and claims priorityfrom U.S. patent application Ser. No. 16/913,065, filed Jun. 26, 2020,which is a non-provisional application for patent entitled to a filingdate and claiming the benefit of earlier-filed U.S. Provisional PatentApplication Ser. No. 62/867,437, filed Jun. 27, 2019, the contents ofwhich are incorporated by reference herein in their entirety.

BACKGROUND Field of the Invention

The field of the invention is data processing, or, more specifically,methods, apparatus, and products for servicing database requests usingcanonicalized tables.

Description Of Related Art

Modern businesses may store large amounts of data in remote databaseswithin cloud-based data warehouses. This data may be accessed usingdatabase query languages, such as structured query language (SQL).Manipulating the data stored in the database may require constructingcomplex queries beyond the abilities of most users. Further, each queryissued to the cloud-based data warehouse may incur a cost and requiretime to wait for the response.

SUMMARY

Methods, systems, and apparatus for servicing database requests usingcanonicalized tables. Servicing database requests using canonicalizedtables includes maintaining a canonical table repository ofcanonicalized tables, wherein each canonicalized table is a transformedversion of a table previously retrieved from a database; receiving, froma client computing system, a request for a table from the database;generating a description of a canonical version of the requested table;determining whether the canonical version of the requested table matchesa canonicalized table in the canonical table repository; and if thecanonical version of the requested table matches the canonicalized tablein the canonical table repository: transforming the matchingcanonicalized table based on the received request for the table; andproviding, to the client computing system, the transformed matchingcanonicalized table.

The foregoing and other objects, features and advantages of theinvention will be apparent from the following more particulardescriptions of exemplary embodiments of the invention as illustrated inthe accompanying drawings wherein like reference numbers generallyrepresent like parts of exemplary embodiments of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 sets forth a block diagram of an example system configured forservicing database requests using canonicalized tables according toembodiments of the present invention.

FIG. 2 sets forth a block diagram of an example system configured forservicing database requests using canonicalized tables according toembodiments of the present invention.

FIG. 3 sets forth a block diagram of an example system configured forservicing database requests using canonicalized tables according toembodiments of the present invention.

FIG. 4 sets forth a flow chart illustrating an exemplary method forservicing database requests using canonicalized tables according toembodiments of the present invention.

FIG. 5 sets forth a flow chart illustrating an exemplary method forservicing database requests using canonicalized tables according toembodiments of the present invention.

DETAILED DESCRIPTION

Exemplary methods, apparatus, and products for servicing databaserequests using canonicalized tables in accordance with the presentinvention are described with reference to the accompanying drawings,beginning with FIG. 1. FIG. 1 sets forth a block diagram of automatedcomputing machinery comprising an exemplary computing system (152)configured for servicing database requests using canonicalized tablesaccording to embodiments of the present invention. The computing system(152) of FIG. 1 includes at least one computer processor (156) or ‘CPU’as well as random access memory (168) (‘RAM’) which is connected througha high speed memory bus (166) and bus adapter (158) to processor (156)and to other components of the computing system (152).

Stored in RAM (168) is an operating system (154). Operating systemsuseful in computers configured for servicing database requests usingcanonicalized tables according to embodiments of the present inventioninclude UNIX™, Linux™, Microsoft Windows™, AIX™, IBM's i OS™, and othersas will occur to those of skill in the art. The operating system (154)in the example of FIG. 1 is shown in RAM (168), but many components ofsuch software typically are stored in non-volatile memory also, such as,for example, on data storage (170), such as a disk drive. Also stored inRAM is the evaluation engine (126), a module for servicing databaserequests using canonicalized tables according to embodiments of thepresent invention.

The computing system (152) of FIG. 1 includes disk drive adapter (172)coupled through expansion bus (160) and bus adapter (158) to processor(156) and other components of the computing system (152). Disk driveadapter (172) connects non-volatile data storage to the computing system(152) in the form of data storage (170). Disk drive adapters useful incomputers configured for servicing database requests using canonicalizedtables according to embodiments of the present invention includeIntegrated Drive Electronics (‘IDE’) adapters, Small Computer SystemInterface (‘SCSI’) adapters, and others as will occur to those of skillin the art. Non-volatile computer memory also may be implemented for asan optical disk drive, electrically erasable programmable read-onlymemory (so-called ‘EEPROM’ or ‘Flash’ memory), RAM drives, and so on, aswill occur to those of skill in the art.

The example computing system (152) of FIG. 1 includes one or moreinput/output (‘I/O’) adapters (178). I/O adapters implementuser-oriented input/output through, for example, software drivers andcomputer hardware for controlling output to display devices such ascomputer display screens, as well as user input from user input devices(181) such as keyboards and mice. The example computing system (152) ofFIG. 1 includes a video adapter (209), which is an example of an I/Oadapter specially designed for graphic output to a display device (180)such as a display screen or computer monitor. Video adapter (209) isconnected to processor (156) through a high speed video bus (164), busadapter (158), and the front side bus (162), which is also a high speedbus.

The exemplary computing system (152) of FIG. 1 includes a communicationsadapter (167) for data communications with other computers and for datacommunications with a data communications network. Such datacommunications may be carried out serially through RS-232 connections,through external buses such as a Universal Serial Bus (‘USB’), throughdata communications networks such as IP data communications networks,and in other ways as will occur to those of skill in the art.Communications adapters implement the hardware level of datacommunications through which one computer sends data communications toanother computer, directly or through a data communications network.Examples of communications adapters useful in computers configured forservicing database requests using canonicalized tables according toembodiments of the present invention include modems for wired dial-upcommunications, Ethernet (IEEE 802.3) adapters for wired datacommunications, and 802.11 adapters for wireless data communications.

The communications adapter (167) is communicatively coupled to a widearea network (190) that also includes a cloud-based data warehouse (192)and a client system (194). The cloud-based data warehouse (192) is acomputing system or group of computing systems that hosts a database foraccess over the wide area network (190). The client system (194) is acomputing system that accesses the database using the evaluation engine(126) on the computing system (152).

FIG. 2 shows an exemplary system for servicing database requests usingcanonicalized tables according to embodiments of the present invention.As shown in FIG. 2, the system includes a client computing system (194),an evaluation engine computing system (152), and a cloud-based datawarehouse (192). The client computing system (194) includes a graphicaluser interface (GUI) (202). The evaluation engine computing system (152)includes an evaluation engine (126) and a canonical table repository(204). The cloud-based data warehouse (192) includes a database (206).

The GUI (202) is a visual presentation configured to present tables inthe form of worksheets and graphical elements to a user. The GUI (202)also receives requests from a user for tables from the database (206).The GUI (202) may be presented, in part, by the evaluation engine (126)and displayed on a client computing system (194) (e.g., on a systemdisplay or mobile touchscreen). The GUI (202) may be part of an Internetapplication that includes the evaluation engine (126) and is hosted onthe evaluation engine computing system (152).

The database (206) is a collection of data and a management system forthe data. A table is a collection of data from the database (206).Tables may be organizations of data sets generated in response to adatabase query and provided to the evaluation engine (126). Tablesinclude data sets organized into columns and rows. The particularcolumns, rows, and organization of the columns and rows that make up atable may be specified in the database query requesting the table. Atable, as sent from the database to the evaluation engine (126) andclient computing system (194), may be a portion or subset of a sourcedatabase table on the database.

The evaluation engine (126) is hardware, software, or an aggregation ofhardware and software configured to receive requests from the clientcomputing system (194), via the GUI (GUI). The evaluation engine (126)is also configured to generate database queries in response to requestsfor data sets and manipulations of those data sets. The evaluationengine (126) may be part of a database query generator that generatesthe database query.

The canonical table repository (204) is an aggregation of hardware andsoftware used to store canonicalized tables. A canonicalized table is aversion of a table configured for comparison and matching. Canonicalizedtables may be used to determine if one table includes the same root dataset as another table (or group of tables) stored in the canonical tablerepository (204). Canonicalized tables may arrange the columns and rowsin a particular order that differs from the order of columns and rows inthe associated table as presented in a worksheet for the user or asstored as the source database table in the database. Further,canonicalized tables may have mutable labels or information in the table(e.g., column and row titles) converted to absolute location information(e.g., column or row number of the source database table).

For example, a user may request a table that includes a particulararrangement of the first ten rows and first ten columns from a databasetable. The evaluation engine (126) may convert the requested table intoa description of the canonicalized version of the table that has adifferent arrangement of the same ten rows and ten columns form thedatabase table. The evaluation engine (126) may then search thecanonical table repository (204) for a canonicalized table that matchesthe canonicalized version of the requested table. If a matchingcanonicalized table exists, then the evaluation engine (126) manipulatesthe canonicalized table into the requested table without having to issuea database query to the database. If a matching canonicalized table doesnot exist, then the evaluation engine (126) issues a database query tothe database, receives the requested table, provides the requested tableto the user, then converts the requested table into a canonicalizedtable and stores the table in the canonical table repository (204).Accordingly, each table retrieved from the database (or the most recenttables) are stored as canonicalized versions in the canonical tablerepository (204). The manner in which the received tables are convertedinto canonical version may be referred to as the canonical conversionpolicy.

As a specific example, assume that the evaluation engine (126) retrievesthe following table from a database that lists the populations of NewYork, Michigan, Washington, Minnesota, Idaho, New Hampshire, Maine,Montana, North Dakota, and Vermont in the years 2016, 2017, and 2018,and sorted from largest to smallest population in 2018. Table 1 showsthe retrieved and presented table.

TABLE 1 State 2016 2017 2018 New York 19,641,589 19,590,719 19,542,209Michigan 9,951,890 9,976,447 9,995,915 Washington 7,294,680 7,425,4327,535,591 Minnesota 5,523,409 5,568,155 5,611,179 Idaho 1,682,9301,718,904 1,754,208 New Hampshire 1,342,373 1,349,767 1,356,458 Maine1,331,370 1,335,063 1,338,404 Montana 1,040,863 1,053,090 1,062,305North Dakota 754,353 755,176 760,077 Vermont 623,644 624,525 626,299

Upon receiving the above table from the database, the evaluation enginemay convert the table to a canonicalized table by removing the rowcolumn labels and resorting the rows base on the row location in thesource database table. Table 2 shows the resulting canonicalized table.

TABLE 2 Col: 8 Col: 9 Col: 10 Row: 14 1,682,930 1,718,904 1,754,208 Row:21 1,331,370 1,335,063 1,338,404 Row: 24 9,951,890 9,976,447 9,995,915Row: 25 5,523,409 5,568,155 5,611,179 Row: 28 1,040,863 1,053,0901,062,305 Row: 31 1,342,373 1,349,767 1,356,458 Row: 34 19,641,58919,590,719 19,542,209 Row: 36 754,353 755,176 760,077 Row: 47 623,644624,525 626,299 Row: 49 7,294,680 7,425,432 7,535,591

The canonical conversion policy may convert two different tables intoidentical canonicalized tables. Similarly, two different requests fortables from the database may result in the same canonicalized tablebeing used to satisfy both requests. For example, a user may issue afirst request for a table with a particular arrangement of rows andcolumns, and issue a second request for a different arrangement of thesame rows and columns. The same canonical table may be used to satisfyboth requests, although it will be transformed differently depending onthe specific request.

FIG. 3 shows an exemplary system for servicing database requests usingcanonicalized tables according to embodiments of the present invention.As shown in FIG. 3, the exemplary GUI (202) includes a spreadsheetstructure (302), a list structure (304), and an exposable parameter(306). The spreadsheet structure (302) includes a worksheet (shown asempty rows) with six columns (column A (306A), column B (306B), column C(306C), column D (306D), column E (306E), column F (306F)).

The spreadsheet structure (302) is a graphical element and organizingmechanism for a worksheet that presents a table. A worksheet is apresentation of a table from a database (204). The spreadsheet structure(302) displays the worksheet as rows of data organized by columns(column A (306A), column B (306B), column C (306C), column D (306D),column E (306E), column F (306F)). The columns delineate differentcategories of the data in each row of the worksheet. The columns mayalso be calculations using other columns in the worksheet.

The list structure (304) is a graphical element used to define andorganize the hierarchical relationships between the columns (column A(306A), column B (306B), column C (306C), column D (306D), column E(306E), column F (306F)) of the data set. The term “hierarchicalrelationship” refers to subordinate and superior groupings of columns.For example, a database may include rows for an address book, andcolumns for state, county, city, and street. A data set from thedatabase may be grouped first by state, then by county, and then bycity. Accordingly, the state column would be at the highest level in thehierarchical relationship, the county column would be in the secondlevel in the hierarchical relationship, and the city column would be atthe lowest level in the hierarchical relationship.

The list structure (304) presents a dimensional hierarchy to the user.Specifically, the list structure (304) presents levels arrangedhierarchically across at least one dimension. Each level within the liststructure (304) is a position within a hierarchical relationship betweencolumns (column A (306A), column B (306B), column C (306C), column D(306D), column E (306E), column F (306F)). The keys within the liststructure (304) identify the one or more columns that are theparticipants in the hierarchical relationship. Each level may have morethan one key.

One of the levels in the list structure (304) may be a base level.Columns selected for the base level provide data at the finestgranularity. One of the levels in the list structure (304) may be atotals or root level. Columns selected for the totals level provide dataat the highest granular level. For example, the totals level may includea field that calculates the sum of each row within a single column ofthe entire data set (i.e., not partitioned by any other column).

The GUI (202) may enable a user to drag and drop columns (column A(306A), column B (306B), column C (306C), column D (306D), column E(306E), column F (306F)) into the list structure (304). The order of thelist structure (304) may specify the hierarchy of the columns relativeto one another. A user may be able to drag and drop the columns in thelist structure (304) at any time to redefine the hierarchicalrelationship between columns. The hierarchical relationship definedusing the columns selected as keys in the list structure (304) may beutilized in charts such that drilling down (e.g., double click on abar), enables a new chart to be generated based on a level lower in thehierarchy.

The GUI (202) may also include a mechanism for a user to request a tablefrom a database to be presented as a worksheet in the GUI (202). Such amechanism may be part of the interactivity of the worksheet.Specifically, a user may manipulate a worksheet (e.g., by dragging anddropping columns or rows, resorting columns or rows, etc.) and, inresponse, the GUI (202) may generate request (e.g., in the form of astate specification) for a table and send the request to the evaluationengine (126). Such a mechanism may also include a direct identificationof the rows and columns of a database table that a user would like toaccess (e.g., via a selection of the rows and columns in a dialog box).

For further explanation, FIG. 4 sets forth a flow chart illustrating anexemplary method for servicing database requests using canonicalizedtables according to embodiments of the present invention that includesmaintaining (402) a canonical table repository (204) of canonicalizedtables, wherein each canonicalized table is a transformed version of atable previously retrieved from a database. Maintaining (402) acanonical table repository (204) of canonicalized tables, wherein eachcanonicalized table is a transformed version of a table previouslyretrieved from a database may be carried out by the evaluation engine(126) converting each table received from the database into acanonicalized table and storing the canonicalized table in the canonicaltable repository (204). Maintaining (402) a canonical table repository(204) of canonicalized tables may also include removing canonicalizedtables to make space available for new canonicalized tables. This may beperformed based on a removal policy, such as removing tables that havenot been accessed in the longest period of time.

The canonicalized tables within the canonical table repository (204) maybe indexed by worksheet specifications describing each canonicalizedtable. Specifically, each canonicalized table may be associated with aworksheet specification that describes the canonicalized table. Eachworksheet specification may describe the source database table, rows,and columns of the associated canonicalized table. For example, adatabase may include a source database table referred to as“state_ceensus_50yrs” that includes census data for each state from 2010to 2018. A table retrieved from the database may have the columns for2014, 2015, and 2016, and the rows for Alabama, Florida, Louisiana,Mississippi, and Texas. The worksheet specification may include the nameof the source data worksheet and a description of the 2014, 2015, and2016 columns and the Alabama, Florida, Louisiana, Mississippi, and Texasrows. In a canonical description, the worksheet specification may be“dbtable:state_census_50yr; col:6,7,8; row:2,11,20,26,45”. The worksheetspecification may then be used to match a similar description of arequested table to a canonicalized table stored in the canonical tablerepository (204).

The method of FIG. 4 further includes receiving (404), from a clientcomputing system (194), a request (420) for a table from the database.Receiving (404), from a client computing system (194), a request (420)for a table from the database may be carried out by the evaluationengine (126) detecting, via a GUI, that a user has manipulated aworksheet or other element displayed within a GUI on the clientcomputing system (194). Such manipulations may include dragging anddropping columns or rows, resorting columns or rows, or identifying rowsand columns of a database table that the user would like to access(e.g., via a selection of the rows and columns in a dialog box). Inresponse, the GUI may generate the request (420) (e.g., in the form of astate specification) for a table and send the request to the evaluationengine (126).

The method of FIG. 4 further includes generating (406) a description ofa canonical version of the requested table. Generating (406) adescription of a canonical version of the requested table may be carriedout by the evaluation engine (126) evaluating the request (420) andconverting the request (420) into a form to be used to attempt to matchthe requested table to a canonical table in the canonical tablerepository (204). The description of a canonical version of therequested table may be in the form of a worksheet specification asdescribed above.

The method of FIG. 4 further includes determining (408) whether thecanonical version of the requested table matches a canonicalized tablein the canonical table repository (204). Determining (408) whether thecanonical version of the requested table matches a canonicalized tablein the canonical table repository (204) may be carried out by theevaluation engine (126) comparing the description of the canonicalversion of the requested table to a description of each canonicalizedtable in the canonical table repository (204) until a match is found. Amatch may be an exact match between the description of the canonicalversion of the requested table and the canonicalized table, such as anexact match between a worksheet specification for the requested tableand the worksheet specification associated with a canonicalized table inthe canonical table repository (204).

For example, assume that the user requests a table from the database (asshown in Table 1) that lists the populations of New York, Michigan,Washington, Minnesota, Idaho, New Hampshire, Maine, Montana, NorthDakota, and Vermont in the years 2016, 2017, and 2018, and sorted fromlargest to smallest population in 2018. The evaluation engine (126) maygenerate a description of a canonical version of the requested table byconverting the row and column labels to absolute values of the row andcolumn numbers of the source database table and reorder the rows basedon the absolute values. The resulting worksheet specification (i.e., thedescription of the canonical version of the requested table) may begenerated as “dbtable:state_census_50yr; col:8,9,10;row:14,21,24,25,28,31,34,36,47,49”. The evaluation engine (126) may thensearch the canonical table repository (204) for a matching canonicalizedtable (e.g., by comparing worksheet specifications). If the canonicaltable repository (204) includes Table 2, then a match has been found.

Determining (408) whether the canonical version of the requested tablematches a canonicalized table in the canonical table repository (204)may be carried out by determining whether the canonical version of therequested table may be generated using at least two canonicalized tablesin the canonical table repository (204). Specifically, the evaluationengine (126) may determine whether the description of the canonicalversion of the requested table may be satisfied using more than onecanonicalized table in the canonical table repository (204).

For example, assume that the canonical table repository (204) includestwo tables with the worksheet descriptions “dbtable:state census 50yr;col:8,9,10; row:14,21,24,25,28” and “dbtable:state_census_50yr;col:8,9,10; row: 31,34,36,47,49”. If the user requests Table 1, above,with the converted worksheet description “dbtable:state_census_50yr;col:8,9,10; row:14,21,24,25,28,31,34,36,47,49”, then the evaluationengine (126) will determine that the request can be satisfied using bothtable “dbtable:state_census_50yr; col:8,9,10; row:14,21,24,25,28” andtable “dbtable:state_census_50yr; col:8,9,10; row: 31,34,36,47,49”.

The method of FIG. 4 further includes if the canonical version of therequested table matches the canonicalized table in the canonical tablerepository: transforming (410) the matching canonicalized table based onthe received request (420) for the table; and providing (412), to theclient computing system (194), the transformed matching canonicalizedtable. Transforming (410) the matching canonicalized table based on thereceived request (420) for the table may be carried out by theevaluation engine (126) retrieving the matching canonicalized table ortables from the canonical table repository (204) and altering thecanonicalized table or tables in accordance with the request. Suchalterations may include converting the absolute row and column values torow and column labels and resorting the columns and/or rows.Transforming (410) the matching canonicalized table based on thereceived request (420) for the table may include combining more than onecanonicalized table into the requested table.

Providing (412), to the client computing system (194), the transformedmatching canonicalized table may be carried out by the evaluation engine(126) presenting, via the GUI on the client computing system (194), thetransformed matching canonicalized table as a worksheet to the user.Providing (412), to the client computing system (194), the transformedmatching canonicalized table may bypass retrieving the requested tablefrom the database. Specifically, because the table or tables wereretrieved locally from the canonical table repository (204), no requestor transfer between the evaluation engine (126) and the cloud-based datawarehouse (192) was required. The requested table is provided withoutinvolving the database on the cloud-based data warehouse (192).

The above limitations improve the operation of the computer system byservicing table requests from a user without issuing a query to adatabase and without the increased latency of database interaction. Thisis accomplished by retrieving previously received tables from a localcanonical table repository (204). Further, because the tables are storedas canonicalized versions of the tables, more requested tables willmatch previously stored table than if the tables were stored in the formas received from the database.

For further explanation, FIG. 5 sets forth a flow chart illustrating afurther exemplary method for servicing database requests usingcanonicalized tables according to embodiments of the present inventionthat continues the flow chart described in FIG. 4. Specifically, asshown in FIG. 5, if the canonical version of the requested table doesnot match any the canonicalized table in the canonical table repository:generating (502) a database query using the request for the table fromthe database; issuing (504) the database query to the database;receiving (506), from the database, the requested table; providing(508), to the client computing system (194), the requested table fromthe database; converting (510) the requested table into a canonicalversion of the requested table; and storing (512) the canonical versionof the requested table in the canonical table repository (204).

Generating (502) a database query using the request for the table fromthe database may be carried out by the evaluation engine (126) using therequest (420) to populate the database query targeting the database onthe cloud-based data warehouse (192). The database query (620) may be anSQL statement. Issuing (504) the database query to the database may becarried out by the evaluation engine (126) sending the generateddatabase query over a wide area network to the database on thecloud-based data warehouse (192).

Receiving (506), from the database, the requested table may be carriedout by the evaluation engine (126) receiving a database query responsethat includes the requested table from the database. The received tablemay be in a form that matches or largely matches the requested table.Once received, the table may undergo some conversion to a form thatmatches the requested table and prepares the received table forpresentation to the client as a worksheet. Providing (508), to theclient computing system (194), the requested table from the database maybe carried out by the evaluation engine (126) presenting, via the GUI onthe client computing system (194), the received table as a worksheet tothe user.

Converting (510) the requested table into a canonical version of therequested table may be carried out by the evaluation engine (126)altering the requested (and received) table based on the canonicalconversion policy. Converting (510) the requested table into thecanonical version of the requested table may include altering columnand/or row labels and reordering one or more columns and/or rows.Storing (512) the canonical version of the requested table in thecanonical table repository (204) may be carried out by the evaluationengine (126) generating a worksheet specification for the canonicalizetable and storing the canonicalized table in the canonical tablerepository (204) indexed by the generated worksheet specification.

In view of the explanations set forth above, readers will recognize thatthe benefits of servicing database requests using canonicalized tablesaccording to embodiments of the present invention include:

Improving the operation of a computing system by servicing databaserequests using a local repository and without issuing a query to adatabase, increasing computing system efficiency.

Improving the operation of a computing system by servicing databaserequests without the increased latency of database interaction,increasing computing system responsiveness.

Exemplary embodiments of the present invention are described largely inthe context of a fully functional computer system for servicing databaserequests using canonicalized tables. Readers of skill in the art willrecognize, however, that the present invention also may be embodied in acomputer program product disposed upon computer readable storage mediafor use with any suitable data processing system. Such computer readablestorage media may be any storage medium for machine-readableinformation, including magnetic media, optical media, or other suitablemedia. Examples of such media include magnetic disks in hard drives ordiskettes, compact disks for optical drives, magnetic tape, and othersas will occur to those of skill in the art. Persons skilled in the artwill immediately recognize that any computer system having suitableprogramming means will be capable of executing the steps of the methodof the invention as embodied in a computer program product. Personsskilled in the art will recognize also that, although some of theexemplary embodiments described in this specification are oriented tosoftware installed and executing on computer hardware, nevertheless,alternative embodiments implemented as firmware or as hardware are wellwithin the scope of the present invention.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

It will be understood from the foregoing description that modificationsand changes may be made in various embodiments of the present inventionwithout departing from its true spirit. The descriptions in thisspecification are for purposes of illustration only and are not to beconstrued in a limiting sense. The scope of the present invention islimited only by the language of the following claims.

What is claimed is:
 1. A method of servicing database requests usingcanonicalized tables, the method comprising: receiving, from a clientcomputing system, a request for a table from a database; determiningthat a canonical version of the requested table matches a canonicalizedtable in a canonical table repository; and providing, to the clientcomputing system, the matching canonicalized table that is transformedbased on the received request for the table.
 2. The method of claim 1,wherein transforming the matching canonical table comprises reorderingat least one column.
 3. The method of claim 1, wherein determiningwhether the canonical version of the requested table matches thecanonicalized table in the canonical table repository comprisesdetermining whether the canonical version of the requested table may begenerated using at least two canonicalized tables in the canonical tablerepository.
 4. The method of claim 1, wherein receiving, from the clientcomputing system, the request for the table from the database comprisesdetecting that a user has manipulated a worksheet displayed within agraphical user interface on the client computing system.
 5. The methodof claim 1, wherein providing, to the client computing system, thetransformed matching canonicalized table bypasses retrieving therequested table from the database.
 6. The method of claim 1, wherein thecanonicalized tables within the canonical table repository are indexedby worksheet specifications describing each canonicalized table.
 7. Anapparatus for servicing database requests using canonicalized tables,the apparatus comprising a computer processor, a computer memoryoperatively coupled to the computer processor, the computer memoryhaving disposed within it computer program instructions that, whenexecuted by the computer processor, cause the apparatus to carry out thesteps of: receiving, from a client computing system, a request for atable from a database; determining that a canonical version of therequested table matches a canonicalized table in a canonical tablerepository; and providing, to the client computing system, the matchingcanonicalized table that is transformed based on the received requestfor the table.
 8. The apparatus of claim 7, wherein transforming thematching canonical table comprises reordering at least one column. 9.The apparatus of claim 7, wherein determining whether the canonicalversion of the requested table matches the canonicalized table in thecanonical table repository comprises determining whether the canonicalversion of the requested table may be generated using at least twocanonicalized tables in the canonical table repository.
 10. Theapparatus of claim 7, wherein receiving, from the client computingsystem, the request for the table from the database comprises detectingthat a user has manipulated a worksheet displayed within a graphicaluser interface on the client computing system.
 11. The apparatus ofclaim 7, wherein providing, to the client computing system, thetransformed matching canonicalized table bypasses retrieving therequested table from the database.
 12. The apparatus of claim 7, whereinthe canonicalized tables within the canonical table repository areindexed by worksheet specifications describing each canonicalized table.13. A computer program product for servicing database requests usingcanonicalized tables, the computer program product disposed upon acomputer readable medium, the computer program product comprisingcomputer program instructions that, when executed, cause a computer tocarry out the steps of: receiving, from a client computing system, arequest for a table from a database; determining that a canonicalversion of the requested table matches a canonicalized table in acanonical table repository; and providing, to the client computingsystem, the matching canonicalized table that is transformed based onthe received request for the table.
 14. The computer program product ofclaim 13, wherein transforming the matching canonical table comprisesreordering at least one column.
 15. The computer program product ofclaim 13, wherein determining whether the canonical version of therequested table matches the canonicalized table in the canonical tablerepository comprises determining whether the canonical version of therequested table may be generated using at least two canonicalized tablesin the canonical table repository.
 16. The computer program product ofclaim 13, wherein receiving, from the client computing system, therequest for the table from the database comprises detecting that a userhas manipulated a worksheet displayed within a graphical user interfaceon the client computing system.
 17. The computer program product ofclaim 13, wherein providing, to the client computing system, thetransformed matching canonicalized table bypasses retrieving therequested table from the database.
 18. The computer program product ofclaim 13, wherein the canonicalized tables within the canonical tablerepository are indexed by worksheet specifications describing eachcanonicalized table.